Inexpensive d-dimensional matchings
نویسندگان
چکیده
Suppose that independent U 0 1 weights are assigned to the (d2)n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expected weight of the minimum-weight perfect d-dimensional matching is at least 3 16n 1− 2/d . We describe a randomized algorithm that finds a perfect d-dimensional matching whose expected weight is at most 5d3n1− 2/d + d15 for all d ≥ 3 and n ≥ 1. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 00, 1–09, 2001
منابع مشابه
Higher Dimensional Aztec Diamonds and a (2d + 2)-Vertex Model
Motivated by the close relationship between the number of perfect matchings of the Aztec diamond graph introduced in [5] and the free energy of the square-ice model, we consider a higher dimensional analog of this phenomenon. For d ≥ 2, we construct d-uniform hypergraphs which generalize the Aztec diamonds and we consider a companion d-dimensional statistical model (called the 2d +2-vertex mode...
متن کاملMatching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [1] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle. We [2] proved this conjecture but here we present a simplified proof. The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We ...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملConnectivity of Matching Graph of Hypercube
The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We prove that the matching graph M(Qd) of the d-dimensional hypercube is bipartite and connected for d ≥ 4. This proves Kreweras’ conjecture [2] that the graph Md is connected, where Md is obtai...
متن کاملNearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
It has been shown that for every perfect matching M of the d-dimensional n-vertex hypercube, d ≥ 2, n = 2, there exists a second perfect matching M ′ such that the union of M and M ′ forms a Hamiltonian circuit of the d-dimensional hypercube. We prove a generalization of a special case of this result when there are two dimensions that do not get used by M . It is known that the number Md of per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 20 شماره
صفحات -
تاریخ انتشار 2002